Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
161	A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-03-12 01:21:32 Complexity classes Cryptography Probabilistic complexity theory Circuit complexity IP Commitment scheme NP Randomized algorithm XTR Theoretical computer science Computational complexity theory Applied mathematics
162	Graph-Based N-gram Language Identification on Short Texts Erik Tromp Mykola Pechenizkiy Department of Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB, Eindhoven, The Netherlands Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-05-13 09:24:15 Computational linguistics Science N-gram Language identification NL Graph SL FO Theoretical computer science Natural language processing Complexity classes
163	Newton’s Method Steve Smale The expression is a mathematical description of Newton’s Method. Long before Newton, the concept already was used by the Greeks for finding the square root of a positive number. Since Newt Add to Reading List Source URL: www.gregkucera.com Language: English - Date: 2015-01-07 20:36:16 Applied mathematics Polynomial Computational complexity theory NP-complete Fundamental theorem of algebra Algorithm Carl Friedrich Gauss NP P Mathematics Theoretical computer science Complexity classes
164	MATH 216 PROBLEM SET 13 This set is due by noon on Friday, March 9. Hand in your homework to me by email. This problem set covers everything up toPlease read all of the problems, and ask me about any statements t Add to Reading List Source URL: math.stanford.edu Language: English - Date: 2012-02-28 14:22:48 Labeling theory Sociology Complexity classes Chess problem P
165	05391 Abstracts Collection Algebraic and Numerical Algorithms and Computer-assisted Proofs Dagstuhl Seminar 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-31 09:29:16 Computer algebra Complexity classes Numerical analysis Algorithm Mathematical logic Polynomial Gröbner basis Computational complexity theory NP Theoretical computer science Applied mathematics Mathematics
166	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics
167	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2006-11-19 23:12:18 Complexity classes Circuit complexity Computability theory Mathematical optimization FO NP-complete P versus NP problem Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
168	Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:14:38 Operations research Computational complexity theory Approximation algorithms Complexity classes Mathematical optimization Polynomial-time approximation scheme Dynamic programming Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics
169	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
170	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics